Given a non-empty integer array of size n, find the minimum number of moves required to make all array elements equal, where a move is incrementing n - 1 elements by 1.
Input: [1,2,3] Output: 3 Explanation: Only three moves are needed (remember each move increments two elements): [1,2,3] => [2,3,3] => [3,4,3] => [4,4,4]
implSolution{pubfnmin_moves(nums:Vec<i32>) -> i32{letmut nums = nums; nums.sort_unstable_by(|a, b| b.cmp(a));letmut ret = 0;for i in1..nums.len(){ ret += (nums[i - 1] - nums[i])* i asi32;} ret }}implSolution{pubfnmin_moves(nums:Vec<i32>) -> i32{let min_num = nums.iter().min().unwrap(); nums.iter().map(|&x| x - min_num).sum()}}